A Parallel Routing Algorithm on Circulant Networks Employing the Hamiltonian Circuit Latin Square
نویسندگان
چکیده
Double-loop and 2-circulant networks are widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on circulant networks, that is a key to the performance of this network. We would like to transmit 2k packets from a source node to a destination node simultaneously along paths on G(n; ±s1,±s2,...,±sk), where the i packet will traverse along the i path (1 ≤ i ≤ 2k). In oder for all packets to arrive at the destination node quickly and securely, the i path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS) we present O(n) parallel routing algorithm on circulant networks.
منابع مشابه
Some Graph Properties of the Optimised Degree Six 3-Modified Chordal Ring Network
The interconnection topology of a parallel or distributed network is pivotal in ensuring good system performance. It can be modelled by a graph, where its edges represent the links between processor nodes represented by vertices. One such graph model that has gained attention by researchers since its founding is the chordal ring, based on an undirected circulant graph. This paper discusses the ...
متن کاملRecursive circulant: a new topology for multicomputer networks (extended abstract)
We propose a new topology for multicomputer networks, called recursive cireulant. Recursive circulant G(N, d) is defined to be a ciwulant graph with N nodes and jumps of powers of d, d 2 2. G(N,d) is node symmetric, has a hamiltonian cycle unless N 5 2, and can be recursively constructed when N = cdm, 1 5 c < d. We analyze various network metrics of G(cdm, d) such as connectivity, diameter, mea...
متن کاملMinimal critical sets for some small Latin squares
A general algorithm for finding a minimal critical set for any latin square is presented. By implementing this algorithm, minimal critical sets for all the latin squares of order six have been found. In addition, this algorithm is used to prove that the size of the minimal critical set for a back circulant latin square of order seven is twelve, and for order nine is twenty. These results provid...
متن کاملMore Greedy De ning Sets in Latin Squares
A Greedy De ning Set is a set of entries in a Latin square with the property that when the square is systematically lled in with a greedy algorithm, the greedy algorithm succeeds. Let g(n) be the smallest Greedy De ning Set for any Latin square of order n. We give theorems on the upper bounds of g(n) and a table listing upper bounds of g(n) for small values of n. For a circulant Latin square, w...
متن کاملMore greedy defining sets in Latin squares
A Greedy Defining Set is a set of entries in a Latin Square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succeeds. Let g(n) be the smallest defining set for any Latin Square of order n. We give theorems on the upper bounds of gn and a table listing upper bounds of gn for small values of n. For a circulant Latin square, we find ...
متن کامل